Reliable Semantics for Extended Logic Programs with Rule Prioritization
نویسندگان
چکیده
منابع مشابه
Reliable Semantics for Extended Logic Programs with Rule Prioritization
We present a new semantics for extended logic programs with rule prioritization (EPP ). The semantics, called reliable semantics (RS), generalizes the well-founded semantics which is defined for normal programs [34]. It also generalizes the extended well-founded semantics which is defined for non-contradictory extended programs [24]. Because of the classical negation in the head of the rules, t...
متن کاملExtended Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence (even in face of odd loops over negation or infinite chains); relevance; cumulativity; and compliance with the Well-Founded Model. We also extend TS to adumbrate ELPs and Disjunctive LPs, though a full account of these...
متن کاملThree-Valued Semantics for Extended Logic Programs
In 4] , the semantics of monotonic (i.e. not-free) extended logic programs (ELPs) has been rephrased in three-valued logic for two purposes: achieving tractable reasoning with incomplete information and understanding the relationships between the existing semantics and many-valued logics. In this paper, we generalize this approach to unrestricted ELPs. We obtain a unifying view of many formalis...
متن کاملParaconsistent Semantics for Extended Logic Programs
We introduce a declarative semantics for extended logic programs, and demonstrate its usefulness for reasoning with uncertainty. We show that this is a robust formalism that overcomes some drawbacks of related xpoint semantics for incomplete or inconsistent logic programs.
متن کاملSemantics for Reasoning with Contradictory Extended Logic Programs
Extended programs are normal programs extended with classical negation. Because of the classical negation in the head of the rules, an extended logic program can be contradictory. Human reasoning is often based on conflicting evidence and on assumptions which are not always valid. Our goal is to derive useful conclusions from programs that may be contradictory. We consider rules to be defaults....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1995
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/5.3.303